C∗-irreducibility of commensurated subgroups
نویسندگان
چکیده
Given a commensurated subgroup $\Lambda$ of group $\Gamma$, we completely characterize when the inclusion $\Lambda\leq \Gamma$ is $C^*$-irreducible and provide new examples such inclusions. In particular, obtain that $\rm{PSL}(n,\mathbb{Z})\leq\rm{PGL}(n,\mathbb{Q})$ for any $n\in \mathbb{N}$, $C^*$-simple into its abstract commensurator $C^*$-irreducible. The main ingredient use fact action $\Lambda\leq\Gamma$ on Furstenberg boundary $\partial_F\Lambda$ can be extended in unique way to an $\Gamma$ $\partial_F\Lambda$. Finally, also investigate counterpart this extension result universal minimal proximal space group.
منابع مشابه
Commensurated Subgroups and Ends of Groups
If G is a group, then subgroups A and B are commensurable if A ∩B has finite index in both A and B. The commensurator of A in G, denoted CommG(A), is {g ∈ G|(gAg−1) ∩A has finite index in both A and gAg−1}. It is straightforward to check that CommG(A) is a subgroup of G. A subgroup A is commensurated in G if CommG(A) = G. The centralizer of A in G is a subgroup of the normalizer of A in G which...
متن کاملCommensurated Subgroups, Semistability and Simple Connectivity at Infinity
A subgroup Q of a group G is commensurated if the commensurator of Q in G is the entire group G. Our main result is that a finitely generated group G containing an infinite, finitely generated, commensurated subgroup H, of infinite index in G is 1-ended and semistable at ∞. If additionally, Q and G are finitely presented and either Q is 1-ended or the pair (G,Q) has 1 filtered end, then G is si...
متن کاملCommensurated Subgroups of Arithmetic Groups, Totally Disconnected Groups and Adelic Rigidity
The Margulis-Zimmer conjecture. The subject of this paper is a well known question advertised by Gregory Margulis and Robert Zimmer since the late 1970’s, which seeks refinement of the celebrated Normal Subgroup Theorem of Margulis (hereafter abbreviated NST). Although Margulis’ NST is stated and proved in the context of (higher rank) irreducible lattices in products of simple algebraic groups ...
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کاملIrreducibility of Hypersurfaces
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most deg(P ) − 1 values of the coefficient. We more generally handle the situation where several specified coefficients vary.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2023
ISSN: ['1945-5844', '0030-8730']
DOI: https://doi.org/10.2140/pjm.2023.322.369